Computing Acyclic Direct Network Reliability Based on First Depth Search 一个计算无圈有向网络可靠性的递归公式
This paper proposes a reusable minimum-time path algorithm for the solution to a special time-dependent network, directed acyclic network. 本文提出一种特殊最短路径算法,即在有向无环网络中最小时间路径算法的一种实现。
Major contributions of this thesis include: 1) advances a new algorithm A~ ( H) to compute all possible paths, the shortest ( longest) path and the ( immediate) ancestor or descendent relation between two nodes on a simple directed acyclic network. 1)对简单有向无环网络中任意两个结点之间的所有可能路径、最短(长)路径以及(直接)前驱后继等问题,本文提出一种新的算法A~H。
A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented. 提出了一种有向无环网络中任意两节点间所有简单路径的通用搜索算法。
Evaluation of performance reliability for multi-state-node acyclic network system 多态结点非循环网络系统的性能可靠性评价
The Simple Algorithm of Finding Shortest Path in Acyclic Network 无环网络中的最短路径问题研究
An algorithm for finding shortest path on Fuzzy acyclic directed network 无圈模糊有向网络最短路径算法
This algorithm can generate a simple expression of reliability and therefore can efficiently compute the reliability of acyclic directed network. 在该公式的基础上提出了一个新的计算无圈有向网络可靠度的不交积和算法,算法可以生成简洁的可靠度表达式,从而可以有效地计算无圈有向网络的可靠度。
TORA, which uses directed acyclic graph and link reversal, adaptive to the extremely active mobile network. TORA使用了有向无环图和链路反转,适合高度动态移动的网络。
By computing the system reliability, the performance reliability of the multi-state-node acyclic network system can be evaluated. 通过系统可靠性的计算,评价多态结点非循环网络系统的性能可靠性。
Moreover, the feasibility and validity of the proposed method has been verified by the demonstrated examples. And the research foundation for optimum design of the reliability of the multi-state-node acyclic network has been provided. 通过仿真实例,验证了提出方法的可行性和有效性,为多态结点非循环网络可靠性的优化设计提供了研究基础。
Current research on network coding basically limits to directed acyclic single-source multicast network, network coding research for multi-source multicast networks is inadequate. 目前网络编码的研究基本上局限于有向无环的单源组播网络,对于多源组播网络中网络编码的研究还不够充分。
Bayesian network is a directed acyclic graph with network structure which is intuitionist and easy understanding. It can handle multi-information expression, data fusion and bi-directional parallel reasoning. The ability to colligate the prior information and the current information makes the inference much more accurate and believable. 贝叶斯网络是一种基于网络结构的有向图解描述,具有多源信息一致表达与信息融合能力,能进行双向并行推理,并能综合先验信息和样本信息,使推理结果更为准确可信。
R.W.Yeung et al. proved that for a single-source acyclic network, linear NC can achieve the maximum flow. R.W.Yeung等人证明了对于单信源无圈网络,线性网络编码就可以达到网络最大流界。
The probability updating algorithm for acyclic Temporal Bayesian network based on model simplification and general probability updating algorithm for Temporal Bayesian network are presented. 其中在时间贝叶斯网络研究中,分别提出了适用于非循环时间贝叶斯网络的基于模型化简的概率更新算法和一般概率更新算法。
Finally, we compare this algorithm with DAG ( Directed Acyclic Graphs) SVM and Neural Network, and we find that right identification rate increases about 3-6 percent. 并与有向无环图SVM和神经网络方法进行了比较,正确识别率提高了3-6个百分点。